#include "BinarySearchTree.hpp"
#include <iostream>
using namespace std;

void Test1(){
  BSTree<int> bst;
  int a[] = {3, 1, 4, 2, 5, 8, 2, 7, 9, 12, 0 ,-5, -4, 1, 2, 3}; 
  for(int e : a)
  {
    bst.rInsert(e); 
  }
  bst.InOrder();

  BSTree<int> b;
  b.Insert(1); 
  b.Insert(2); 
  b.Insert(3); 
  bst = b;
  bst.InOrder();
}

int main(){
  Test1();
  return 0;
}
